A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication
نویسنده
چکیده
This paper deals with parallels of the fast matrix multiplication strassen's algorithm, winograd’s algorithm and analyzes empirical study of the matrix multiplication under the distributed environment in which PVM (Parallel Virtual Machine) environment is implemented. The contribution of this paper is that the parallelism of matrix-matrix multiplication need personal computer (or workstation cluster), which is not supercomputer. Firstly, we represent standard, strassen and winograd algorithm for matrix-matrix multiplication. Secondly, we develop a parallel implementation with masterslave processor. Thirdly, the efficiency of the proposed implementations is evaluated by using PVM.
منابع مشابه
Autotuning Divide-and-Conquer Matrix-Vector Multiplication
Divide and conquer is an important concept in computer science. It is used ubiquitously to simplify and speed up programs. However, it needs to be optimized, with respect to parameter settings for example, in order to achieve the best performance. The problem boils down to searching for the best implementation choice on a given set of requirements, such as which machine the program is running o...
متن کاملSkeletons for Divide and Conquer Algorithms
Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined components. We present a fully distributed task parallel skeleton for a very general class of divide and conquer algorithms for MIMD machines with distributed memory. This approach is compared to a simple masterworker design. Based on experimental results for different e...
متن کاملDeep Parameter Tuning of Concurrent Divide and Conquer Algorithms in Akka
Akka is a widely-used high-performance and distributed computing toolkit for fine-grained concurrency, written in Scala for the Java Virtual Machine. Although Akka elegantly simplifies the process of building complex parallel software, many crucial decisions that a↵ect system performance are deferred to the user. Employing the method of Deep Parameter Tuning to extract embedded ‘magic numbers’ ...
متن کاملArchitecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high performance computers with memory hierarchies non-trivial. In this paper we present our ndings on eecient implementation of Strassen's algorithmm17] for the ubiquitous operation of matrix multiplication as a model for a class of recursive algorithms. In comparison to...
متن کاملDivide and conquer the Hilbert space of translation-symmetric spin systems.
Iterative methods that operate with the full Hamiltonian matrix in the untrimmed Hilbert space of a finite system continue to be important tools for the study of one- and two-dimensional quantum spin models, in particular in the presence of frustration. To reach sensible system sizes such numerical calculations heavily depend on the use of symmetries. We describe a divide-and-conquer strategy f...
متن کامل